An Efficient Rank Based Approach for Closest String and Closest Substring
نویسندگان
چکیده
This paper aims to present a new genetic approach that uses rank distance for solving two known NP-hard problems, and to compare rank distance with other distance measures for strings. The two NP-hard problems we are trying to solve are closest string and closest substring. For each problem we build a genetic algorithm and we describe the genetic operations involved. Both genetic algorithms use a fitness function based on rank distance. We compare our algorithms with other genetic algorithms that use different distance measures, such as Hamming distance or Levenshtein distance, on real DNA sequences. Our experiments show that the genetic algorithms based on rank distance have the best results.
منابع مشابه
More Efficient Algorithms for Closest String and Substring Problems
The closest string and substring problems find applications in PCR primer design, genetic probe design, motif finding, and antisense drug design. For their importance, the two problems have been extensively studied recently in computational biology. Unfortunately both problems are NP-complete. Researchers have developed both fixed-parameter algorithms and approximation algorithms for the two pr...
متن کاملA Closer Look at the Closest String and Closest Substring Problem
Let S be a set of k strings over an alphabet Σ; each string has a length between ` and n. The Closest Substring Problem (CSSP) is to find a minimal integer d (and a corresponding string t of length `) such that each string s ∈ S has a substring of length ` with Hamming distance at most d to t. We say t is the closest substring to S. For ` = n, this problem is known as the Closest String Problem...
متن کامل0 00 20 12 v 1 1 7 Fe b 20 00 On The Closest String and Substring Problems ∗
The problem of finding a center string that is ‘close’ to every given string arises and has many applications in computational molecular biology and coding theory. This problem has two versions: the Closest String problem and the Closest Substring problem. Assume that we are given a set of strings S = {s1, s2, . . . , sn} of strings, say, each of length m. The Closest String problem [1, 2, 4, 5...
متن کاملGeneralized closest substring encryption
We propose a new cryptographic notion called generalized closest substring encryption. In this notion, a ciphertext encrypted with a string S can be decrypted with a private key of another string S′, if there exist a substring of S, i.e. Ŝ, and a substring of S′, i.e. Ŝ′, that are “close” to each other measured by their “overlap distance”. The overlap distance between Ŝ and Ŝ′ is the number of ...
متن کاملA Meta Heuristic Solution for Closest String Problem Using Ant Colony System
Suppose ∑ is the alphabet set and S is the set of strings with equal length over alphabet ∑. The closest substring problem seeks for a substring over ∑ that minimizes the maximum hamming distance with other substrings in S. The closest substring problem is NP-complete. This problem has particular importance in 180 F. Bahredar et al computational biology and coding theory. In this paper we prese...
متن کامل